Separating 3-cycles in plane triangulations
نویسندگان
چکیده
منابع مشابه
Separating 3-cycles in plane triangulations
The maximal number of separating 3-cycles in a plane triangulation with given order under certain distance conditions between these 3-cycles is determined. Moreover, a construction principle of the class of triangulations possessing the maximal number of separating 3-cycles, which is based on a set of extremal members, is presented. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملHamilton cycles in plane triangulations
We extend Whitney’s Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely we define a decomposition of a plane triangulation G into 4-connected ‘pieces’ and show that if each piece shares a triangle with at most three other pieces then G is hamiltonian. We provide an example to show that our hypothesis that ‘each...
متن کاملOn light cycles in plane triangulations
A subgraph of a plane graph is light if each of its vertices has a small degree in the entire graph. Consider the class ~¢-(5) of plane triangulations of minimum degree 5. It is known that each G C,Y-(5) contains a light triangle. From a recent result of Jendrol' and Madaras the existence of light cycles C4 and C5 in each G C.~(5) follows. We prove here that each G E.Y-(5) contains also light c...
متن کاملRainbow Numbers for Cycles in Plane Triangulations
In the article, the existence of rainbow cycles in edge colored plane triangulations is studied. It is shown that the minimum number rb(Tn,C3) of colors that force the existence of a rainbow C3 in any n-vertex plane triangulation is equal to 3n−4 2 . For k ≥ 4 a lower bound and for k ∈ {4,5} an upper bound of the number rb(Tn,Ck ) is determined. C © 2014 Wiley Periodicals, Inc. J. Graph Theory ...
متن کاملOn 3-coloring of plane triangulations
Let G be a plane triangulation. For a color-assignment λ : V (G) → {1, 2, 3}, a face of G whose vertices receive all three colors is called a vivid face with respect to λ. Let hλ(G) be the number of vivid faces in G with respect to λ. Let C(G) be the set of 3-color-assignments of G and let G(n) be the set of plane triangulations with n faces. Let h(G) = max{hλ(G) : λ ∈ C(G)} and h(n) = min{h(G)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00047-4